3

The tree center problems and the relationship with the bottleneck knapsack problems

Year:
1997
Language:
english
File:
PDF, 57 KB
english, 1997
4

Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions

Year:
2000
Language:
english
File:
PDF, 454 KB
english, 2000
5

A Linear Time Algorithm for Finding ak-Tree Core

Year:
1997
Language:
english
File:
PDF, 173 KB
english, 1997
6

Quadratic M-convex and L-convex functions

Year:
2004
Language:
english
File:
PDF, 308 KB
english, 2004
7

Substitutes and complements in network flows viewed as discrete convexity

Year:
2005
Language:
english
File:
PDF, 196 KB
english, 2005
11

Minimization of an M-convex function

Year:
1998
Language:
english
File:
PDF, 343 KB
english, 1998
17

The MA-ordering max-flow algorithm is not strongly polynomial for directed networks

Year:
2004
Language:
english
File:
PDF, 188 KB
english, 2004
20

Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra

Year:
2012
Language:
english
File:
PDF, 400 KB
english, 2012
21

Matroid rank functions and discrete concavity

Year:
2012
Language:
english
File:
PDF, 190 KB
english, 2012
22

Exact bounds for steepest descent algorithms of L

Year:
2014
Language:
english
File:
PDF, 406 KB
english, 2014
31

M-Convex Function on Generalized Polymatroid

Year:
1999
Language:
english
File:
PDF, 459 KB
english, 1999
33

M-Convex Function on Generalized Polymatroid

Year:
1999
Language:
english
File:
PDF, 151 KB
english, 1999
36

Buyback problem with discrete concave valuation functions

Year:
2017
Language:
english
File:
PDF, 812 KB
english, 2017